We consider infinite horizon Markov decision processes (MDPs) with fast-slow structure, meaning that certain parts of the state space move "fast" (and in a sense, are more influential) while other parts transition more "slowly." Such structure is common in real-world problems where sequential decisions need to be made at high frequencies, yet information that varies at a slower timescale also influences the optimal policy. Examples include: (1) service allocation for a multi-class queue with (slowly varying) stochastic costs, (2) a restless multi-armed bandit with an environmental state, and (3) energy demand response, where both day-ahead and real-time prices play a role in the firm's revenue. Models that fully capture these problems often result in MDPs with large state spaces and large effective time horizons (due to frequent decisions), rendering them computationally intractable. We propose an approximate dynamic programming algorithmic framework based on the idea of "freezing" the slow states, solving a set of simpler finite-horizon MDPs (the lower-level MDPs), and applying value iteration (VI) to an auxiliary MDP that transitions on a slower timescale (the upper-level MDP). We also extend the technique to a function approximation setting, where a feature-based linear architecture is used. On the theoretical side, we analyze the regret incurred by each variant of our frozen-state approach. Finally, we give empirical evidence that the frozen-state approach generates effective policies using just a fraction of the computational cost, while illustrating that simply omitting slow states from the decision modeling is often not a viable heuristic.

The security of artificial intelligence (AI) is an important research area towards safe, reliable, and trustworthy AI systems. To accelerate the research on AI security, the Artificial Intelligence Security Competition (AISC) was organized by the Zhongguancun Laboratory, China Industrial Control Systems Cyber Emergency Response Team, Institute for Artificial Intelligence, Tsinghua University, and RealAI as part of the Zhongguancun International Frontier Technology Innovation Competition (https://www.zgc-aisc.com/en). The competition consists of three tracks, including Deepfake Security Competition, Autonomous Driving Security Competition, and Face Recognition Security Competition. This report will introduce the competition rules of these three tracks and the solutions of top-ranking teams in each track.

在这项工作中，我们解决了共同跟踪手对象姿势并从野外深度点云序列重建形状的具有挑战性，HandTrackNet，以估计框架间的手动运动。我们的HandTrackNet提出了一个新型的手姿势构成典型化模块，以简化跟踪任务，从而产生准确且稳健的手工关节跟踪。然后，我们的管道通过将预测的手关节转换为基于模板的参数手模型mano来重建全手。对于对象跟踪，我们设计了一个简单而有效的模块，该模块从第一帧估算对象SDF并执行基于优化的跟踪。最后，采用联合优化步骤执行联合手和物体推理，从而减轻了闭塞引起的歧义并进一步完善了手姿势。在训练过程中，整个管道仅看到纯粹的合成数据，这些数据与足够的变化并通过深度模拟合成，以易于概括。整个管道与概括差距有关，因此可以直接传输到真实的野外数据。我们在两个真实的手对象交互数据集上评估我们的方法，例如HO3D和DEXYCB，没有任何填充。我们的实验表明，所提出的方法显着优于先前基于深度的手和对象姿势估计和跟踪方法，以9 fps的帧速率运行。

报告了基于小波的算法以提高语音清晰度以及完整数据集和结果的优化。通过多级离散小波变换，离散的语音信号分为频率子频段。在重组以形成演讲的修改版本之前，将各种收益应用于子兰信号。在保持总体信号能量不变的同时，调整了子带的收益，并使用Google语音到文本转录在各种背景干扰和模拟听力损失条件下进行语音清晰度得到了客观和定量的评估。一组通用的子带收益可以在高达4.8 dB的一系列噪声与信号比率上起作用。对于无噪声的语音，通过将光谱能量重新分配给中频频带，总体可理解性得到提高，Google的转录精度平均提高了16.9个百分点，最大值提高了86.7个百分点。对于已经被噪声损坏的语音，提高清晰度是具有挑战性的，但仍然可以实现，而转录精度的平均为9.5个百分点，最高为71.4。所提出的算法可用于实时语音处理，并且比以前的算法更简单。潜在的应用包括语音增强，助听器，机器聆听以及对语音清晰度的更好理解。

随着线提供额外的约束，利用线特征可以有助于提高基于点的单眼视觉惯性内径（VIO）系统的定位精度。此外，在人工环境中，一些直线彼此平行。在本文中，我们设计了一种基于点和直线的VIO系统，它将直线分成结构直线（即彼此平行的直线）和非结构直线。另外，与使用四个参数表示3D直线的正交表示不同，我们仅使用两个参数来最小化结构直线和非结构直线的表示。此外，我们设计了一种基于采样点的直线匹配策略，提高了直线匹配的效率和成功率。我们的方法的有效性在EUROC和TUM VI基准的公共数据集上验证，与其他最先进的算法相比。

We study the problem of learning the objective functions or constraints of a multiobjective decision making model, based on a set of sequentially arrived decisions. In particular, these decisions might not be exact and possibly carry measurement noise or are generated with the bounded rationality of decision makers. In this paper, we propose a general online learning framework to deal with this learning problem using inverse multiobjective optimization. More precisely, we develop two online learning algorithms with implicit update rules which can handle noisy data. Numerical results show that both algorithms can learn the parameters with great accuracy and are robust to noise.

Transformers are widely used in NLP tasks. However, current approaches to leveraging transformers to understand language expose one weak spot: Number understanding. In some scenarios, numbers frequently occur, especially in semi-structured data like tables. But current approaches to rich-number tasks with transformer-based language models abandon or lose some of the numeracy information - e.g., breaking numbers into sub-word tokens - which leads to many number-related errors. In this paper, we propose the LUNA framework which improves the numerical reasoning and calculation capabilities of transformer-based language models. With the number plugin of NumTok and NumBed, LUNA represents each number as a whole to model input. With number pre-training, including regression loss and model distillation, LUNA bridges the gap between number and vocabulary embeddings. To the best of our knowledge, this is the first work that explicitly injects numeracy capability into language models using Number Plugins. Besides evaluating toy models on toy tasks, we evaluate LUNA on three large-scale transformer models (RoBERTa, BERT, TabBERT) over three different downstream tasks (TATQA, TabFact, CrediTrans), and observe the performances of language models are constantly improved by LUNA. The augmented models also improve the official baseline of TAT-QA (EM: 50.15 -> 59.58) and achieve SOTA performance on CrediTrans (F1 = 86.17).

Online forms are widely used to collect data from human and have a multi-billion market. Many software products provide online services for creating semi-structured forms where questions and descriptions are organized by pre-defined structures. However, the design and creation process of forms is still tedious and requires expert knowledge. To assist form designers, in this work we present FormLM to model online forms (by enhancing pre-trained language model with form structural information) and recommend form creation ideas (including question / options recommendations and block type suggestion). For model training and evaluation, we collect the first public online form dataset with 62K online forms. Experiment results show that FormLM significantly outperforms general-purpose language models on all tasks, with an improvement by 4.71 on Question Recommendation and 10.6 on Block Type Suggestion in terms of ROUGE-1 and Macro-F1, respectively.

许多数据分析任务在很大程度上依赖对表的深入了解（多维数据）。在整个任务中，都存在表字段 /列的共同使用的元数据属性。在本文中，我们确定了四个这样的分析元数据：测量/维度二分法，公共场作用，语义场类型和默认聚集函数。尽管这些元数据面临不足的监督信号的挑战，利用现有的知识和理解分布。为了将这些元数据推理为原始表，我们提出了多任务元数据模型，该模型将现场分布和知识图信息融合到预训练的表格模型中。对于模型培训和评估，我们通过使用下游任务的各种智能监督来收集分析元数据的大型语料库（来自私人电子表格和公共表格数据集的〜582K表）。我们的最佳模型的精度= 98％，命中率在TOP-1> 67％，精度> 80％和四个分析元数据推理任务的精度= 88％。它的表现优于基于规则，传统机器学习方法和预训练的表格模型的一系列基线。分析元数据模型被部署在流行的数据分析产品中，帮助下游智能功能，例如Insights挖掘，图表 /枢轴表建议和自然语言QA ...

耐药性是对全球健康的重大威胁，以及整个疾病和药物发育的临床治疗中的重要疑虑。与药物结合有关的蛋白质中的突变是适应性耐药性的常见原因。因此，对突变如何影响药物和靶蛋白之间的相互作用的定量估计对于药物开发和临床实践来说是至关重要的。已经证明，依赖于分子动力学模拟，Rosetta方案以及机器学习方法的计算方法能够预测对蛋白质突变的配体亲和力变化。然而，严重限制的样本量和重质噪声诱导的过烧和泛化问题已经很广泛地采用了用于研究耐药性的机器学习。在本文中，我们提出了一种稳健的机器学习方法，称为Spldextratees，其可以准确地预测蛋白质突变并鉴定引起抗性突变的配体结合亲和力。特别是，所提出的方法按照易于学习的样本开始的特定方案级别，逐渐融入训练中的特定方案，然后在训练中迭代，然后在样本权重再验计算和模型更新之间迭代。此外，我们计算了基于物理的基于物理的结构特征，为机器学习模型提供了对这种数据有限预测任务的蛋白质的有价值的域知识。该实验证实了提出的方法在三种情况下预测激酶抑制剂抗性的方法，并实现了与分子动力学和Rosetta方法相当的预测准确性，具有较少的计算成本。